Asymptotic optimality of shortest path routing algorithms
نویسندگان
چکیده
منابع مشابه
Asymptotic optimality of shortest path routing algorithms
Many communicat ion networks use adaptive shortest path routing. By this we mean that each network link is periodically assigned a length that depends on its congestion level during the preceding period, and all traffic generated between length updates is routed along a shortest path corresponding to the latest link lengths. We show that in certain situations, typical of networks involving a la...
متن کاملComparison of the Q-Routing and Shortest Path Routing Algorithms
In this paper, we compare the self-adaptive QRouting and dual reinforcement Q-Routing algorithms with the conventional shortest path routing algorithm. The Q-Routing algorithm embeds a learning policy at every node to adapt itself to the changing network conditions, which leads to a synchronised routing information, in order to achieve a shortest delivery time. Unlike Q-Routing, the shortest pa...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملAsymptotic Optimality of Balanced Routing
Consider a system with K parallel single-servers, each with its own waiting room. Upon arrival, a job is to be routed to the queue of one of the servers. Finding routing policy that minimizes the total workload in the system is a known difficult problem in general. Even if the optimal policy is identified, the policy would require the full queue length information at the arrival of each job; fo...
متن کاملK shortest path algorithms
This paper is focussed on algorithms to solve the k-shortest path problem. Three codes were described and compared on rand and grid networks using random generators available on http://www.dis.uniroma1.it/∼challenge9 Codes were also tested on the USA road networks available on the same URL address. One million paths were ranked in less than 3 seconds on random instances with 10 000 nodes and 10...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1987
ISSN: 0018-9448
DOI: 10.1109/tit.1987.1057274